package com.example.leetcode.matrix;

import com.example.leetcode.matrix.common.MatrixUtils;

class Solution1632 {
    /**
     * 考察并查集和拓扑排序
     *
     * @param matrix
     * @return
     */
    // todo 先提交跳过，后面再做
    public int[][] matrixRankTransform(int[][] matrix) {
        return MatrixUtils.matrixRankTransform(matrix);
    }
}

public class leetcode1632 {
    public static void main(String[] args) {
        Solution1632 solution1632 = new Solution1632();
        int[][] matrix = {{20, -21, 14}, {-19, 4, 19}, {22, -47, 24}, {-19, 4, 19}};
        int[][] rankTransform = solution1632.matrixRankTransform(matrix);
        MatrixUtils.printMatrix(rankTransform);
    }
}
